Computational Aspects for Constructing Realizations of Polynomial Chaos in High Dimension
نویسندگان
چکیده
منابع مشابه
Identification of Polynomial Chaos Representations in High Dimension from a Set of Realizations
This paper deals with the identification in high dimensions of a polynomial chaos expansion of random vectors from a set of realizations. Due to numerical and memory constraints, the usual polynomial chaos identification methods are based on a series of truncations that induce a numerical bias. This bias becomes very detrimental to the convergence analysis of polynomial chaos identification in ...
متن کاملConstructing Continuous-Time Chaos-Generating Templates Using Polynomial Approximation
Aiming at developing a methodology for constructing continuous-time chaotic dynamical systems as flexible pattern generators, this paper discusses a strategy for binding desired unstable periodic orbits into a chaotic attractor. The strategy is comprised of the following two stages: constructing an interim “chaos-generating template”, and deforming the template according to the specifically des...
متن کاملComputational aspects of multivariate polynomial interpolation
The paper is concerned with the practical implementation of two methods to compute the solution of polynomial interpolation problems. In addition to a description of the implementation, practical results and several improvements will be discussed, focusing on speed and robustness of the algorithms under consideration.
متن کاملComputational Aspects of the Hausdorff Distance in Unbounded Dimension
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspaceor vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed to be homothetically transformed in order to minimize its Hausdorff distance to another one. For this problem, we characterize optimal solutions, deduce a Hell...
متن کاملPolynomial realizations of some trialgebras
We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an internal product, and several bases. Résumé. Nous réalisons plusieurs algèbres de Hopf combinatoires dont les bases sont indexées par les partitions d’ensembl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2010
ISSN: 1064-8275,1095-7197
DOI: 10.1137/100787830